Optimum diagnosing of computer networks
نویسندگان
چکیده
منابع مشابه
On finding optimum paths in computer networks
1 Supported in part by a grant from the Texas Advanced Research Program. Abstract-We consider the problem of finding an optimum path from each node in the network to a destination node in the network. Typically, each edge in the network is assigned a weight value (e.g. bandwidth or delay), and a metric function (e.g. min or +) is applied consecutively to the edges in the path. The result is the...
متن کاملDiagnosing Large-Scale Failures in Computer Networks
In this paper, we propose an algorithm to efficiently diagnose large-scale clustered failures. The algorithm, Cluster-MAX-COVERAGE (CMC), is based on greedy approach. We address the challenge of determining faults with incomplete symptoms. CMC makes novel use of both positive and negative symptoms to output a hypothesis list with a low number of false negatives and false positives quickly. CMC ...
متن کاملOptimum Design of Sewer Collection Networks
Various methods have been used to economically design wastewater and stormwater collection systems. In this article, Discrete Differential Dynamic Programming (DDDP) which is a subsection of dynamic programming (DP) was used. For each pipe network, various alternatives such as depth and slope of pipe laying and various diameters could be considered to satisfy hydraulic and engineering constrain...
متن کاملOptimum Design of Sewer Collection Networks
Various methods have been used to economically design wastewater and stormwater collection systems. In this article, Discrete Differential Dynamic Programming (DDDP) which is a subsection of dynamic programming (DP) was used. For each pipe network, various alternatives such as depth and slope of pipe laying and various diameters could be considered to satisfy hydraulic and engineering constrain...
متن کاملoptimum design of sewer collection networks
various methods have been used to economically design wastewater and stormwater collection systems. in this article, discrete differential dynamic programming (dddp) which is a subsection of dynamic programming (dp) was used. for each pipe network, various alternatives such as depth and slope of pipe laying and various diameters could be considered to satisfy hydraulic and engineering constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Informatization and Management
سال: 2007
ISSN: 2073-4751
DOI: 10.18372/2073-4751.2.9097